Convergence analysis of SART: optimization and statistics
نویسنده
چکیده
Simultaneous algebraic reconstruction technique (SART) [1, 2] is an iterative method for solving inverse problems of form Ax(+n) = b. This type of problems arises for example in computed tomography reconstruction, in which case A is obtained from discrete Radon transform. In this paper, we provide several methods for derivation of SART and connections between SART and other methods. Using these connections, we also prove the convergence of SART in different ways. These approaches are from optimization and statistical points of view and can be applied to other Landweber-like schemes such as Cimmino’s algorithm and component averaging (CAV). Furthermore, the noisy case is considered and error estimation is given. Several numerical experiments for computed tomography reconstruction are provided to demonstrate the convergence results in practice.
منابع مشابه
Variable Weighted Ordered Subset Image Reconstruction Algorithm
We propose two variable weighted iterative reconstruction algorithms (VW-ART and VW-OS-SART) to improve the algebraic reconstruction technique (ART) and simultaneous algebraic reconstruction technique (SART) and establish their convergence. In the two algorithms, the weighting varies with the geometrical direction of the ray. Experimental results with both numerical simulation and real CT data ...
متن کاملTechnical Note: Convergence analysis of a polyenergetic SART algorithm.
PURPOSE The authors analyze a recently proposed polyenergetic version of the simultaneous algebraic reconstruction technique (SART). This algorithm, denoted polyenergetic SART (pSART), replaces the monoenergetic forward projection operation used by SART with a postlog, polyenergetic forward projection, while leaving the rest of the algorithm unchanged. While the proposed algorithm provides good...
متن کاملConvergence of trajectories in infinite horizon optimization
In this paper, we investigate the convergence of a sequence of minimizing trajectories in infinite horizon optimization problems. The convergence is considered in the sense of ideals and their particular case called the statistical convergence. The optimality is defined as a total cost over the infinite horizon.
متن کاملOn the Convergence Analysis of Gravitational Search Algorithm
Gravitational search algorithm (GSA) is one of the newest swarm based optimization algorithms, which has been inspired by the Newtonian laws of gravity and motion. GSA has empirically shown to be an efficient and robust stochastic search algorithm. Since introducing GSA a convergence analysis of this algorithm has not yet been developed. This paper introduces the first attempt to a formal conve...
متن کاملOn the Convergence Analysis of Gravitational Search Algorithm
Gravitational search algorithm (GSA) is one of the newest swarm based optimization algorithms, which has been inspired by the Newtonian laws of gravity and motion. GSA has empirically shown to be an efficient and robust stochastic search algorithm. Since introducing GSA a convergence analysis of this algorithm has not yet been developed. This paper introduces the first attempt to a formal conve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Math.
دوره 90 شماره
صفحات -
تاریخ انتشار 2013